POSTECH - MLG - 2011 - 011 Patch - Based Markov Ran - dom Fields for Fast Face Oc - clusion Recovery a
نویسنده
چکیده
In this paper we present Markov random field (MRF) models for face occlusion detection and recovery. For occlusion detection, we use a pixel-based pair-wise MRF model (which is similar to the Ising model) where the binary mask on each pixel is inferred to decide the presence of occlusion. Then we construct a patch-based nonparametric pair-wise MRF model for occlusion recovery, which is learned using occlusion-free face images in the training set. Probabilistic inference using α-expansion leads to fast occlusion recovery, compared to the existing method. Numerical experiments confirm that our method speeds up the existing method by several orders of magnitude, while the quality of recovery is as good as the existing one. ato be presented at MLSP-2011. 2 J. -M. Yun and S. Choi CONTENTS
منابع مشابه
A New Fast and Efficient HMM-Based Face Recognition System Using a 7-State HMM Along With SVD Coefficients
In this paper, a new Hidden Markov Model (HMM)-based face recognition system is proposed. As a novel point despite of five-state HMM used in pervious researches, we used 7-state HMM to cover more details. Indeed we add two new face regions, eyebrows and chin, to the model. As another novel point, we used a small number of quantized Singular Values Decomposition (SVD) coefficients as feature...
متن کاملFace Photo Sketch Synthesis via Larger Patch and Multiresolution Spline
Face photo sketch synthesis has got some researchers' attention in recent years because of its potential applications in digital entertainment and law enforcement. Some patches based methods have been proposed to solve this problem. These methods usually focus more on how to get a sketch patch for a given photo patch than how to blend these generated patches. However, without appropriately blen...
متن کاملOn Equilibrium of an Adaptive Single Component Market
A mathematical model of an adaptive SamuelMarshall type single component market described by quasilinear functional differential equations with dependent on phase coordinates and frequently switched an ergodic Markov process is presented. The proposed method is based on an averaging procedure with respect to time along the critical solutions of the generative average linear equation and with re...
متن کاملOptimal resource allocation for multiqueue systems with a shared server pool
We study optimal allocation of servers for a system with multiple service facilities and with a shared pool of servers. Each service facility poses a constraint on the maximum expected sojourn time of a job. A central decision maker can dynamically allocate servers to each facility, where adding more servers results in faster processing speeds but against higher utilization costs. The objective...
متن کاملMarkovian Delay Prediction-Based Control of Networked Systems
A new Markov-based method for real time prediction of network transmission time delays is introduced. The method considers a Multi-Layer Perceptron (MLP) neural model for the transmission network, where the number of neurons in the input layer is minimized so that the required calculations are reduced and the method can be implemented in the real-time. For this purpose, the Markov process order...
متن کامل